Asymptotic analysis of a leader election algorithm
نویسندگان
چکیده
منابع مشابه
Asymptotic analysis of a leader election algorithm
Itai and Rodeh showed that, on the average, the communication of a leader election algorithm takes no more than $LN$ bits, where $L \simeq 2.441716$ and $N$ denotes the size of the ring. We give a precise asymptotic analysis of the average number of rounds M(n) required by the algorithm, proving for example that $\dis M(\infty) := \lim\_{n\to \infty} M(n) = 2.441715879...$, where $n$ is the num...
متن کاملAnalysis of an Asymmetric Leader Election Algorithm
We consider a leader election algorithm in which a set ofdistributed 'ob· jects (people, computers, elc.) try to identify one object as their leader. The election process is randomized, that is, at every stage of the algorithm. those objects that survived so far flip abiased coin, and those who received, say a tail. survive for the next round. The process .continues until only one objects remai...
متن کاملA probabilistic analysis of a leader election algorithm
A leader election algorithm is an elimination process that divides recursively into tow subgroups an initial group of n items, eliminates one subgroup and continues the procedure until a subgroup is of size 1. In this paper the biased case is analyzed. We are interested in the cost of the algorithm, i.e. the number of operations needed until the algorithm stops. Using a probabilistic approach, ...
متن کاملA Modified Leader Election Algorithm for MANET
Distributed systems are the backbone of modern day computing services. A mobile ad hoc network (MANET) is a collection of mobile nodes that can communicate via message passing over wireless links. Communication takes place directly between nodes which are in transmission range of each other else communication is done through message relay. A MANET is different from existing distributed network ...
متن کاملAnalysis of Leader Election Algorithms
We start with a set of n players. With some probability P (n, k), we kill n−k players; the other ones stay alive, and we repeat with them. What is the distribution of the number Xn of phases (or rounds) before getting only one player? We present a probabilistic analysis of this algorithm under some conditions on the probability distributions P (n, k), including stochastic monotonicity and the a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2006
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2006.03.027